Finite Petri nets as models for recursive causal behaviour

Finite Petri Nets as Models for Recursive Causal Behaviour

We will show that the answer depends on the chosen notion of behaviour. It was already known that the interleaving behaviour and the branching structure of terms as B can be modelled as long as causality is not taken into account. We now show that also the causal behaviour of B can be modelled as long as the branching structure is not taken into account. However, it is not possible to represent...

Maximality Semantic For Recursive Petri Nets

This paper is in the framework of the specification and the verification of concurrent dynamic systems. We are interested by recursive Petri net specification model for which we define a maximality semantics. The underlying semantic model is a maximality-based labeled transition system. For this purpose, we propose a maximality operational semantic for recursive Petri nets. As an illustration, ...

Petri Nets as Models of Linear Logic

The chief purpose of this paper is to appraise the feasibility of Girard’s linear logic as a specification language for parallel processes. To this end we propose an interpretation of linear logic in Petri nets, with respect to which we investigate the expressive power of the logic.

Infinite Behaviour of Petri Nets

Functorial Models for Petri Nets

We show that although the algebraic semantics of place/transition Petri nets under the collective token philosophy can be fully explained in terms of strictly symmetric monoidal categories, the analogous construction under the individual token philosophy is not completely satisfactory, because it lacks universality and also functoriality. We introduce the notion of pre-net to recover these aspe...